Perfect Codes in Cartesian Products of 2-Paths and Infinite Paths
نویسندگان
چکیده
منابع مشابه
Perfect Codes in Cartesian Products of 2-Paths and Infinite Paths
We introduce and study a common generalization of 1-error binary perfect codes and perfect single error correcting codes in Lee metric, namely perfect codes on products of paths of length 2 and of infinite length. Both existence and nonexistence results are given.
متن کاملOn the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
Let G be a graph. A 2-rainbow dominating function (or 2-RDF) of G is a function f from V(G) to the set of all subsets of the set {1,2} such that for a vertex v ∈ V (G) with f(v) = ∅, thecondition $bigcup_{uin N_{G}(v)}f(u)={1,2}$ is fulfilled, wher NG(v) is the open neighborhoodof v. The weight of 2-RDF f of G is the value$omega (f):=sum _{vin V(G)}|f(v)|$. The 2-rainbowd...
متن کاملInfinite paths in planar graphs III, 1-way infinite paths
An infinite graph is 2-indivisible if the deletion of any finite set of vertices from the graph results in exactly one infinite component. Let G be a 4-connected, 2indivisible, infinite, plane graph. It is known that G contains a spanning 1-way infinite path. In this paper, we prove a stronger result by showing that, for any vertex x and any edge e on a facial cycle of G, there is a spanning 1-...
متن کاملOn the crossing numbers of Cartesian products with paths
Using a newly introduced operation on graphs and its counterpart on graph drawings, we prove the conjecture of Jendrol’ and Ščerbová from 1982 about the crossing number of the Cartesian product K1,m2Pn. Our approach is applicable to the capped Cartesian products of Pn with any graph containing a dominating vertex.
متن کاملOn the crossing number of Cartesian products with paths
Using a newly introduced operation on graphs and its counterpart on graph drawings, we prove the conjecture of Jendrol’ and Ščerbová from 1982 about the crossing number of the Cartesian product K1,m2Pn. Our approach is applicable to the capped Cartesian products of Pn with any graph containing a dominating vertex.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2005
ISSN: 1077-8926
DOI: 10.37236/1962